Fast Parallel Multiplication with Parallel On-the-fly Conversion
نویسنده
چکیده
Fast multiplication can be constructed by combining the tree structure of multiplication's addition, i.e. Wallace tree, with the parallel on-they conversion to have a multiplication without using any carry propagation adder at the end. This parallel on-they conversion speeds up the conversion of redundant binary to conventional binary. With the delay of n 4 , we can have the conversion from redundant binary to conventional digit faster than regular Carry Propagation Adder.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملطراحی یک روش آموزش ناموازی جدید برای تبدیل گفتار با عملکردی بهتر از آموزش موازی
Introduction: The art of voice mimicking by computers, has with the computer have been one of the most challenging topics of speech processing in recent years. The system of voice conversion has two sides. In one side, the speaker is the source that his or her voice has been changed for mimicking the target speaker’s voice (which is on the other side). Two methods of p...
متن کاملFast parallel conversion of edge list to adjacency list for large-scale graphs
In the era of bigdata, we are deluged with massive graph data emerged from numerous social and scientific applications. In most cases, graph data are generated as lists of edges (edge list), where an edge denotes a link between a pair of entities. However, most of the graph algorithms work efficiently when information of the adjacent nodes (adjacency list) for each node are readily available. A...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFast and Scalable Parallel Matrix
We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconngurable pipelined optical bus systems. These problems include computing the N th power, the inverse, the characteristic polynomial, the determinant, the rank, and an LU-and a QR-factorization of a matrix, and solving linear systems of equations. These c...
متن کامل